Corrigendum to ?The dynamic berth allocation problem for a container port? 6Transportation Research Part B 35 (2001) 401?4179
نویسندگان
چکیده
منابع مشابه
A novel approach to resolve the Dynamic Discrete Berth Allocation Problem in a Container Terminal
In this paper, we are interested in the modeling and the resolution of the dynamic and discrete berth allocation problem which is noted DDBAP. To resolve this problem, we propose a heuristic approach of optimization which combines two concepts: agent and heuristics. This approach is based on the use of the multi-agent negotiation, the contract net protocol, and a set of heuristics such as the W...
متن کاملthe continuous dynamic berth allocation problem at a marine container terminal with tidal constraints in the access channel
we consider the problem of continuous dynamic berth allocation to containerships in a tidal seaport. in some container ports, low water depth in coastal area causes many restrictions on providing vessel's services. therefore, berth allocation planning for relatively large vessels with high draft is subject to tidal conditions when the vessels are in the access channel as from anchorage are...
متن کاملSimulation-Optimization Models for the Dynamic Berth Allocation Problem
Container terminals are designed to provide support for the continuous changes in container ships. The most common schemes used for dock management are based on discrete and continuous locations. In view of the steadily growing trend in increasing container ship size, more flexible berth allocation planning is mandatory. The consideration of continuous location in the container terminal is a go...
متن کاملBerth allocation in a container port: using a continuous location space approach
This paper addresses the berth allocation problem in a multi-user container terminal. There are two typical schemes for berth allocation: one in discrete locations and the other in continuous locations. The former has the advantage of easiness in scheduling but it has a weakness in that terminal usage is not fully efficient. The latter exhibits the complete opposite characteristics. In previous...
متن کاملGenetic Algorithm for Dynamic Berth Allocation Problem with Discrete Layout
Genetic Algorithm which is based on the Darwinian principle of natural selection has been successfully applied to Berth allocation problem (BAP), which can decide the ships’ berthing position and berthing time at a container terminal. Considering the service priority, handing time deciding variables, safety clearance, as well as the berths’ physical conditions, a dynamic berth allocation with d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Part B: Methodological
سال: 2004
ISSN: 0191-2615
DOI: 10.1016/s0191-2615(04)00045-1